Comparison of Ant-Inspired Gatherer Allocation Approaches Using Memristor-Based Environmental Models

نویسندگان

  • Ella Gale
  • Ben de Lacy Costello
  • Andrew Adamatzky
چکیده

Memristors are used to compare three gathering techniques in an already-mapped environment where resource locations are known. The All Site model, which apportions gatherers based on the modeled memristance of that path, proves to be good at increasing overall efficiency and decreasing time to fully deplete an environment, however it only works well when the resources are of similar quality. The Leaf Cutter method, based on Leaf Cutter Ant behaviour, assigns all gatherers first to the best resource, and once depleted, uses the All Site model to spread them out amongst the rest. The Leaf Cutter model is better at increasing resource influx in the short-term and vastly out-performs the All Site model in a more varied environments. It is demonstrated that memristor based abstractions of gatherer models provide potential methods for both the comparison and implementation of agent controls.ions of gatherer models provide potential methods for both the comparison and implementation of agent controls. keywords: memristor memristors networks gathering model multi-agent systems ants leaf-cutter Atta gatherer animal behaviour ar X iv :1 30 2. 07 97 v1 [ cs .N E ] 4 F eb 2 01 3 Comparison of Ant-Inspired Gatherer Allocation Approaches using Memristor-Based Environmental Models Ella Gale, Ben de Lacy Costello Andrew Adamatzky 1. Unconventional Computing Group, University of the West of England, Bristol, UK, [email protected] http://uncomp.uwe.ac.uk/index.html

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of a Hybrid Robot Control System using Memristor-Model and Ant-Inspired Based Information Transfer Protocols

It is not always possible for a robot to process all the information from its sensors in a timely manner and thus quick and yet valid approximations of the robot’s situation are needed. Here we design hybrid control for a robot within this limit using algorithms inspired by ant worker placement behaviour and based on memristor-based non-linearity.

متن کامل

Comparison of Ant Colony, Elite Ant system and Maximum – Minimum Ant system Algorithms for Optimizing Coefficients of Sediment Rating Curve (Case Study: Sistan River)

By far, different models for determining the relationship between the flow rate  and amount of precipitation have been developed. many models are based on regression models with limited assumptions. one of the most common methods for estimating  sediment of rivers is sediment rating curve. for better estimation of the amount of sediment based of sediment curve  rating equation, it is possible t...

متن کامل

Estimation of Global Solar Irradiance Using a Novel combination of Ant Colony Optimization and Empirical Models

In this paper, a novel approach for the estimation of global solar irradiance is proposed based on a combination of empirical correlation and ant colony optimization. Empirical correlation has been used to estimate monthly average of daily global solar irradiance on a horizontal surface. The Ant Colony Optimization (ACO) algorithm has been applied as a swarm-intelligence technique to tune the c...

متن کامل

Navigation-based Optimization of Stochastic Deployment Strategies for a Robot Swarm to Multiple Sites

We present a biologically inspired approach to the dynamic assignment and reassignment of a swarm of homogeneous robots to multiple locations, with applications in search and rescue, environmental monitoring, and task allocation. Our work is inspired by experimental studies of ant house hunting and empirical models that predict the behavior of the colony that is faced with a choice between mult...

متن کامل

New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011